GPU-Based Dynamic Hyperspace Hash with Full Concurrency
نویسندگان
چکیده
منابع مشابه
A Dynamic Hash Table for the GPU
We design and implement a fully concurrent dynamic hash table for GPUs with comparable performance to the state of the art static hash tables. We propose a warp-cooperative work sharing strategy that reduces branch divergence and provides an efficient alternative to the traditional way of per-thread (or per-warp) work assignment and processing. By using this strategy, we build a dynamic nonbloc...
متن کاملForward Progress on GPU Concurrency
The tutorial at CONCUR will provide a practical overview of work undertaken over the last six years in the Multicore Programming Group at Imperial College London, and with collaborators internationally, related to understanding and reasoning about concurrency in software designed for acceleration on GPUs. In this article we provide an overview of this work, which includes contributions to data ...
متن کاملGPU-Based High Performance Password Recovery Technique for Hash Functions
Due to the development of GPGPU (General Purpose Graphic Processing Unit) technology, GPU has been applied in many computation tasks as accelerators. In this paper, a new password recovery technique for the standardized hash functions, MD5 and SHA1, are proposed by combining the optimization methods on GPU. The performance on AMD HD7970 is 2615 mc/s for SHA1 and 6877 mc/s for MD5, which is 10 t...
متن کاملAdaptive Structural Control Using Dynamic Hyperspace
The design of closed-loop structural control systems necessitates a certain level of robustness to cope with system uncertainties. Neurocontrollers, a type of adaptive control system, have been proposed to cope with those uncertainties. However, the performance of neural networks can be substantially influenced by the choice of the input space, or the hyperspace in which the representation lies...
متن کاملHash-Based Dynamic Source Routing (HB-DSR)
This paper presents and evaluates Hash-Based DSR, an extension of theDSR protocol. This protocol reduces the per-packet control overhead of DSR by compressing the source-route with a Bloom lter. Simulations on large networks show that HB DSR increases the network capacity by a factor of up to 15. HB DSR is an attractive alternative to DSR for large ad-hoc networks. Another important property of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Data Science and Engineering
سال: 2021
ISSN: 2364-1185,2364-1541
DOI: 10.1007/s41019-021-00161-5